/*
 * Atomic Predicates for Transformers
 * 
 * Copyright (c) 2015 UNIVERSITY OF TEXAS AUSTIN. All rights reserved. Developed
 * by: HONGKUN YANG and SIMON S. LAM http://www.cs.utexas.edu/users/lam/NRL/
 * 
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * with the Software without restriction, including without limitation the
 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
 * sell copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 * 
 * 1. Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimers.
 * 
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimers in the documentation
 * and/or other materials provided with the distribution.
 * 
 * 3. Neither the name of the UNIVERSITY OF TEXAS AUSTIN nor the names of the
 * developers may be used to endorse or promote products derived from this
 * Software without specific prior written permission.
 * 
 * 4. Any report or paper describing results derived from using any part of this
 * Software must cite the following publication of the developers: Hongkun Yang
 * and Simon S. Lam, Scalable Verification of Networks With Packet Transformers
 * Using Atomic Predicates, IEEE/ACM Transactions on Networking, October 2017,
 * Volume 25, No. 5, pages 2900-2915 (first published as IEEE Early Access
 * Article, July 2017, Digital Object Identifier: 10.1109/TNET.2017.2720172).
 * 
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH
 * THE SOFTWARE.
 */
package transformer;

import java.io.IOException;
import java.util.ArrayList;

import common.PositionTuple;

public class NATAPLinkUpdate {

    public static void main(String[] args) throws IOException
    {
        NetworkAP i2 = new NetworkAP("i2");

        i2.add_nat_ap(9);

        double up_time = 0;
        double down_time = 0;
        
        ArrayList<PositionTuple []> events = new ArrayList<PositionTuple[]> ();
        

        for(PositionTuple pt0 : i2.getallactiveports())
        {
            for(PositionTuple pt1 : i2.getallactiveports())
            {
                for(PositionTuple pt2 : i2.LinkTransfer(pt1))
                {
                    if(!pt0.equals(pt1) && !pt0.equals(pt2))
                    {
                        PositionTuple[] event = new PositionTuple[3];
                        event[0] = pt0;
                        event[1] = pt1;
                        event[2] = pt2;
                        
                        events.add(event);
                    }
                }
            }
        }
        System.out.println(events.size() + " events");
        
        for(PositionTuple[] event : events)
        {
            StateTransferAP stfer = new StateTransferAP(i2);
            System.out.println(event[0]+" " + event[1]+ " " + event[2]);
            
            stfer.Traverse(event[0]);
            long t1 = System.nanoTime();
            stfer.del_link(event[1], event[2]);
            long t2 = System.nanoTime();
            stfer.add_link(event[1], event[2]);
            long t3 = System.nanoTime();
            
            up_time += (t3-t2)/1000000.0;
            down_time += (t2-t1)/1000000.0;
        }
        
        System.out.println("up:" + up_time/events.size());
        System.out.println("down:" + down_time/events.size());
        
        
        
        


    }

}
